Quantum Optimization Problems

نویسنده

  • Tomoyuki Yamakami
چکیده

Krentel [J. Comput. System. Sci., 36, pp.490–509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomialtime computations. This paper expands his framework to a quantum optimization problem using polynomial-time quantum computations and introduces the notion of an “universal” quantum optimization problem similar to a classical “complete” optimization problem. We exhibit a canonical quantum optimization problem that is universal for the class of polynomial-time quantum optimization problems. We show in a certain relativized world that all quantum optimization problems cannot be approximated closely by quantum polynomial-time computations. We also study the complexity of quantum optimization problems in connection to well-known complexity classes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...

متن کامل

Approximability of Optimization Problems through Adiabatic Quantum Computation

Read more and get great! That's what the book enPDFd approximability of optimization problems through adiabatic quantum computation synthesis lectures on quantum computing will give for every reader to read this book. This is an on-line book provided in this website. Even this book becomes a choice of someone to read, many in the world also loves it so much. As what we talk, when you read more ...

متن کامل

Combinatorial Optimization on Gate Model Quantum Computers: A Survey

The advent of quantum computing processors with possibility to scale beyond experimental capacities magnifies the importance of studying their applications. Combinatorial optimization problems can be one of the promising applications of these new devices. These problems are recurrent in industrial applications and they are in general difficult for classical computing hardware. In this work, we ...

متن کامل

Gain optimization of the optical waveguide based on the quantum box core/shell structure

In order to implement an integrated optical quantum circuit, designing waveguides based on the quantum box is of prime importance. To do this we have investigated optical waveguide both with and without optical pumping. The rate of absorption and emission using an array of AlGaAs/GaAs quantum box core/shell structure in the optical waveguide with various pumping intensities has computed. By con...

متن کامل

OPTIMUM SHAPE DESIGN OF DOUBLE-LAYER GRIDS BY QUANTUM BEHAVED PARTICLE SWARM OPTIMIZATION AND NEURAL NETWORKS

In this paper, a methodology is presented for optimum shape design of double-layer grids subject to gravity and earthquake loadings. The design variables are the number of divisions in two directions, the height between two layers and the cross-sectional areas of the structural elements. The objective function is the weight of the structure and the design constraints are some limitations on str...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002